Polynomial threshold functions and Boolean threshold circuits
نویسندگان
چکیده
منابع مشابه
Polynomial Threshold Functions and Boolean Threshold Circuits
We study the complexity of computing Boolean functions on general Boolean domains by polynomial threshold functions (PTFs). A typical example of a general Boolean domain is {1, 2}. We are mainly interested in the length (the number of monomials) of PTFs, with their degree and weight being of secondary interest. We show that PTFs on general Boolean domains are tightly connected to depth two thre...
متن کاملOn threshold circuits and polynomial computation
A Threshold Circuit consists of an acyclic digraph of unbounded fanin, where each node computes a threshold function or its negation. This paper investigates the computational power of Threshold Circuits. A surprising relationship is uncovered between Threshold Circuits and another class of unbounded fanin circuits which are denoted Finite Field ZP (n) Circuits, where each node computes either ...
متن کاملBoolean Functions: Influence, threshold and noise
This lecture studies the analysis of Boolean functions and present a few ideas, results, proofs, and problems. We start with the wider picture of expansion in graphs and then concentrate on the graph of the n-dimensional discrete cube Ωn. Boolean functions are functions from Ωn to {0, 1}. We consider the notion of the influence of variables on Boolean functions. The influence of a variable on a...
متن کاملABC Conjecture , and Polynomial Threshold Functions
We present a number of papers on topics in mathematics and theoretical computer science. Topics include: a problem relating to the ABC Conjecture, the ranks of 2-Selmer groups of twists of an elliptic curve, the Goldbach problem for primes in specified Chebotarev classes, explicit models for Deligne-Lusztig curves, constructions for small designs, noise sensitivity bounds for polynomials thresh...
متن کاملPolynomial Threshold Functions: Structure, Approximation and Pseudorandomness
We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows that low-degree polynomial threshold functions cannot approximate any function with many influential variables. We provide a couple of examples where this tech...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2015
ISSN: 0890-5401
DOI: 10.1016/j.ic.2014.09.008